Randomization Enhanced Blind Signature Schemes Based on RSA
نویسندگان
چکیده
In this letter, we show that Fan-Chen-Yeh’s blind signature scheme and Chien-Jan-Tseng’s partially blind signature scheme are vulnerable to the chosen–plaintext attack. We also show that both schemes can be modified so that the chosen– plaintext attack is impossible. But, still Chien-Jan-Tseng’s partially blind signature scheme is vulnerable. It fails to satisfy the partial blindness property. key words: Blind signature scheme, anonymity, chosen– plaintext attack, randomization
منابع مشابه
Double voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملRandomization enhanced Chaum's blind signature scheme
At Crypto’99, Dr Coron, Naccache, and Stern presented a signature forgery strategy of the RSA digital signature scheme. The attack is valid on Chaum’s blind signature scheme, which has been applied to many practical applications such as electronic cash and voting. In this paper we propose a method to inject a randomizing factor into a message when it is signed by the signer in Chaum’s blind sig...
متن کاملAn Attack on Untraceable Blind Signature Scheme 不可追蹤式盲簽章機制之攻擊法
* This research is partially supported by the National Science Council, Taiwan, R.O.C., under grant NSC92-2213-E-110-035. Abstract Hwang, Lee, and Lai introduced a new blind signature scheme based on RSA cryptosystem. In this paper, their scheme is demonstrated as being insecure and an improved scheme against the attack is proposed. In addition, Hwang, Lee, and Lai’s comments on Fan’s blind sig...
متن کاملA GOST-like Blind Signature Scheme Based on Elliptic Curve Discrete Logarithm Problem
In this paper, we propose a blind signature scheme and three practical educed schemes based on elliptic curve discrete logarithm problem. The proposed schemes impart the GOST signature structure and utilize the inherent advantage of elliptic curve cryptosystems in terms of smaller key size and lower computational overhead to its counterpart public key cryptosystems such as RSA and ElGamal. The ...
متن کاملAn Exploitation of Blind Signature Schemes to Simulate Privacy-related Applications
This paper presents the simulation of privacy-related applications employing blind signature (BS) schemes. Two popular privacy-related applications: 'traditional BS based electronic voting system (EVS)' and 'traditional offline electronic payment protocol (EPP)' have been chosen here. A BS scheme is a cryptographic protocol that plays a vital role to conduct the electronic t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999